Nuprl Lemma : R-Feasible-possible 11,40

R:Realizer.
R-Feasible(R)
 (es:ES. (Possible(R;es) & (ix:Id. R-discrete(R)(<ix>)?ff = discrete(i;x ))) 
latex


DefinitionsRealizer, t  T, x:AB(x), discrete(i;x), ff, <ab>, IdDeq, Id, product-deq(A;B;a;b), R-discrete(R), , Type, x:A  B(x), x.A(x), xt(x), f(x)?z, s = t, x:AB(x), Possible(R;es), P & Q, ES, x:AB(x), R-Feasible(R), P  Q, P  Q, P  Q, [[R]], d-feasible-discrete(D;discrete), f(x), f(a), b, x  dom(f), a:A fp B(a), Top, left + right, Unit, , b, A, False, PossibleWorld(D;w), t.1, ES(the_w), FairFifo, A c B, World
Lemmaspossible-world wf, fair-fifo wf, w-es wf, not wf, bnot wf, fpf-ap wf, assert of bnot, eqff to assert, iff transitivity, eqtt to assert, top wf, fpf wf, fpf-trivial-subtype-top, fpf-dom wf, assert wf, R-discrete-property, R-Feasible-Dsys, d-feasible-world, R-Dsys wf, R-Feasible wf, event system wf, R-possible wf, Id wf, fpf-cap wf, bool wf, R-discrete wf, product-deq wf, id-deq wf, bfalse wf, es-isconst wf, es realizer wf

origin